Permanence in polymatrix replicators
نویسندگان
چکیده
Generally a biological system is said to be permanent if under small perturbations none of the species goes extinction. In 1979 P. Schuster, K. Sigmund, and R. Wolff [15] introduced concept permanence as stability notion for systems that models self-organization macromolecules. After, in 1987 W. Jansen rid="b9">9], J. Hofbauer Sigmund rid="b6">6] give sufficient conditions replicator equations. this paper we extend these results polymatrix replicators.
منابع مشابه
Replicators Don't!
Replicators don't. Replicate, that is. This is the shocking conclusion to which I have been forced by my attempt to gure out what precisely Richard Dawkins means by the term \replicator". Actually, it seems that Dawkins uses the term in at least two fundamentally diierent ways; but according to Dawkins' own speciication of the problem which the \replicator" concept was intended to solve (namely...
متن کاملApproximating Nash Equilibria in Tree Polymatrix Games
We develop a quasi-polynomial time Las Vegas algorithm for approximating Nash equilibria in polymatrix games over trees, under a mild renormalizing assumption. Our result, in particular, leads to an expected polynomial-time algorithm for computing approximate Nash equilibria of tree polymatrix games in which the number of actions per player is a fixed constant. Further, for trees with constant ...
متن کاملPolymatrix and Generalized Polynacci Numbers
We considerm-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the definition of reflected sequence and inverted sequence and we establish some relationship between the coefficients of the Cayley-Hamilton equation for these matrice...
متن کاملOptimization Using Replicators
Replicator systems are among the simplest complex systems and can be considered to be at the foundation of many popularly used models ranging from theories of evolution and neuro-biology to sociobiology and ecology. This paper presents the rst successful application 2 of replicators to optimization problems. For a graph bipartitioning problem with 50,000 nodes and 300,000 edges, for instance, c...
متن کاملComputing Constrained Approximate Equilibria in Polymatrix Games
This paper is about computing constrained approximate Nash equilibria in polymatrix games, which are succinctly represented manyplayer games defined by an interaction graph between the players. In a recent breakthrough, Rubinstein showed that there exists a small constant ǫ, such that it is PPAD-complete to find an (unconstrained) ǫ-Nash equilibrium of a polymatrix game. In the first part of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of dynamics and games
سال: 2021
ISSN: ['2164-6066', '2164-6074']
DOI: https://doi.org/10.3934/jdg.2020032